Perturbative manifolds and the Noether generators of nth-order Poisson equations

A manifold that contains small perturbations will induce a perturbed partial differential equation. The partial differential equation that we select is the Poisson equation – in order to explore the interplay between the geometry of the manifold and the perturbations. Specifically, we show how the problem of symmetry determination, for higher-order perturbations, can be elegantly expressed via geometric conditions.     

Mean Field Behaviour of Spin Systems with Orthogonal Interaction Matrix

For the long-range deterministic spin models with glassy behaviour of Marinari, Parisi and Ritort we prove weighted factorization properties of the correlation functions which represent the natural generalization of the factorization rules valid for the Curie–Weiss case.     

关于圈的完全正矩阵实现

本文给出了一个关联图为圈的非负、半正定矩阵A为完全正的一个充要条件.我们还证明了这样的矩阵A（当A为完全正时）的分解指数即为A的阶数.     

On isomorphic factorizations of circulant graphs

We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006     

D→PP衰变过程的末态相互作用

利用单粒子交换方法,研究了D介子衰变到两个赝标粒子中的末态相互作用.通过实验数据中抽取的强相角来分析末态相互作用的效应     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

Factorization of operator valued Lp for 0 ≤ p < 1

In [5], it is proved that a bounded linear operator u, from a Banach space Y into an L_p(S, ν) factors through L_p1 (S, ν) for some p₁ > 1, if Y* is of finite cotype; (S, ν) is a probability space for p = 0, and any measure space for 0 < p < 1. In this paper, we generalize this result to uv, where u : Y → L_p(S, ν) and v : X → Y are linear operators such that v* is of finite Ka?in cotype. This result gives also a new proof of Grothendieck's theorem. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

完全正矩阵的整数分解

n阶矩阵A称为完全正的,如果A有分解:A=BB^T,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数.     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.     

两类整函数的素性

本文就用Nevanlinna理论研究了两类整函数的素性，所得结果推广了Prokopovich和华歆厚的有关定理。